On data - driven derivation of discrete mappings between nite

نویسندگان

  • Uwe Beyer
  • Frank Smieja
چکیده

The guessing of a function behind a discrete mapping between nite spaces using only the information provided by positive examples is shown to be in principle optimally handled by a lookup table combined with a random process. We explore the implications of this result for the construction of intelligent approxi-mators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On data - driven derivation of discrete mappings

The guessing of a function behind a discrete mapping between nite spaces using only the information provided by positive examples is shown to be in principle optimally handled by a lookup table combined with a random process. We explore the implications of this result for the construction of intelligent approximators.

متن کامل

On Identities with Additive Mappings in Rings

begin{abstract} If $F,D:Rto R$ are additive mappings which satisfy $F(x^{n}y^{n})=x^nF(y^{n})+y^nD(x^{n})$ for all $x,yin R$. Then, $F$ is a generalized left derivation with associated Jordan left derivation $D$ on $R$. Similar type of result has been done for the other identity forcing to generalized derivation and at last an example has given in support of the theorems. end{abstract}

متن کامل

Double Derivations, Higher Double Derivations and Automatic Continuity

Let  be a Banach algebra. Let  be linear mappings on . First we demonstrate a theorem concerning the continuity of double derivations; especially that all of -double derivations are continuous on semi-simple Banach algebras, in certain case. Afterwards we define a new vocabulary called “-higher double derivation” and present a relation between this subject and derivations and finally give some ...

متن کامل

On degrees of vertices in paradoxical trees

We present some necessary and su cient conditions (in terms of degrees of vertices) for locally nite tree T=(V; E) to be paradoxical, i.e. to have a partition V=V1∪V2 and one-to-one mappings fi :V → Vi; i=1; 2 such that the supremum of the distances between v and fi(v) over v ∈ V and i = 1; 2 is nite. c © 2000 Published by Elsevier Science B.V. All rights reserved.

متن کامل

Discrete time robust control of robot manipulators in the task space using adaptive fuzzy estimator

This paper presents a discrete-time robust control for electrically driven robot manipulators in the task space. A novel discrete-time model-free control law is proposed by employing an adaptive fuzzy estimator for the compensation of the uncertainty including model uncertainty, external disturbances and discretization error. Parameters of the fuzzy estimator are adapted to minimize the estimat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007